Average Case Analysis of Marking Algorithms
نویسندگان
چکیده
منابع مشابه
Average Case Analysis of Marking Algorithms
The Lindstrom marking algorithm uses bounded workspace. Its time complexity is O(n) in all cases, but it has been assumed that the average case time complexity is O(n lg n). It is proven that the average case time complexity is Θ(n). Similarly, the average size of the Wegbreit bit stack is shown to be Θ(n).
متن کاملAutomatic Average { case Analysis of Algorithms
Many probabilistic properties of elementary discrete combinatorial structures of interest for the average{case analysis of algorithms prove to be decidable. This paper presents a general framework in which such decision procedures can be developed: It is based on a combination of generating function techniques for counting, and complex analysis techniques for asymptotic estimations. We expose h...
متن کاملTechniques of the Average Case Analysis of Algorithms
This is an extended version of a book chapter that I wrote for the Handbook on Algorithms and Theon) of Computation (Ed. M. Atallah) in which some probabilistic and analytical techniques of the average case analysis of algorithms are reviewed. By analytical techniques we mean those in which complex analysis plays a primary role. We choose one facet of the theory of algorithms, namely that of al...
متن کاملAverage-case analysis of VCG with approximate resource allocation algorithms
The Vickrey-Clarke-Groves (VCG) mechanism offers a general technique for resource allocation with payments, ensuring allocative efficiency while eliciting truthful information about preferences. However, VCG relies on exact computation of an optimal allocation of resources, a problem which is often computationally intractable, and VCG that uses an approximate allocation algorithm no longer guar...
متن کاملAverage Case Analysis of Dynamic Graph Algorithms 25
[32] V. V. Vazirani. A theory of alternating paths and blossoms for proving correctness of the O(p V E) general graph maximum matching algorithm. [13] G. N. Frederickson. Ambivalent data structures for dynamic 2-edge-connectivity and k smallest spanning trees. Linear time algorithms for nding a sparse k-connected spanning subgraph of a k-connected graph. Re-randomization and average case analys...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Computing
سال: 1986
ISSN: 0097-5397,1095-7111
DOI: 10.1137/0215076